Shape Learning with Function-Described Graphs
نویسندگان
چکیده
A new method for shape learning is presented in this paper. This method incorporates abilities from both statistical and structural pattern recognition approaches to shape analysis. It borrows from statistical pattern recognition the capability of modelling sets of point coordinates, and from structural pattern recognition the ability of dealing with highly irregular patterns, such as those generated by points missingness. To that end we use a novel adaptation of Procrustes analysis, designed by us to align sets of points with missing elements. We use this information to generate sets of attributed graphs (AGs). From each set of AGs we synthesize a function-described graph (FDG), which is a type of compact representation that has the capability of probabilistic modelling of both structural and attribute information. Multivariate normal probability density estimation is used in FDGs instead of the originally used histograms. Comparative results of classification performance are presented of structural vs. attributes + structural information.
منابع مشابه
GRAPE: using graph grammars to implement shape grammars
An implementation of a shape grammar interpreter is described. The underlying graph-theoretic framework is briefly discussed to show how alternative representations from graph theory including graphs, overcomplete graphs and hyperedge graphs can support some of the intuitions handled in shape grammars by direct visual computations with shapes. The resulting plugin implemented in Rhino, code-nam...
متن کاملSome Results on the Maximal 2-Rainbow Domination Number in Graphs
A 2-rainbow dominating function ( ) of a graph is a function from the vertex set to the set of all subsets of the set such that for any vertex with the condition is fulfilled, where is the open neighborhood of . A maximal 2-rainbow dominating function on a graph is a 2-rainbow dominating function such that the set is not a dominating set of . The weight of a maximal is the value . ...
متن کاملDeep Learning with Dynamic Computation Graphs
Neural networks that compute over graph structures are a natural fit for problems in a variety of domains, including natural language (parse trees) and cheminformatics (molecular graphs). However, since the computation graph has a different shape and size for every input, such networks do not directly support batched training or inference. They are also difficult to implement in popular deep le...
متن کاملSparse Approximations to Value Functions in Reinforcement Learning
We present a novel sparsification and value function approximation method for on-line reinforcement learning in continuous state and action spaces. Our approach is based on the kernel least squares temporal difference learning algorithm. We derive a recursive version and enhance the algorithm with a new sparsification mechanism based on the topology obtained from proximity graphs. The sparsific...
متن کاملNovel Feature Selection and Kernel-Based Value Approximation Method for Reinforcement Learning
We present a novel sparsification and value function approximation method for on-line reinforcement learning in continuous state and action spaces. Our approach is based on the kernel least squares temporal difference learning algorithm. We derive a recursive version and enhance the algorithm with a new sparsification mechanism based on the topology maps represented by proximity graphs. The spa...
متن کامل